Processing Recommender Top-N Queries in Relational Databases
نویسندگان
چکیده
منابع مشابه
Processing Recommender Top-N Queries in Relational Databases
According to the feedback information from a user in the result sets of initial or previous queries, we present in this paper a framework for processing recommender top-N queries in relational databases. Based on the techniques and ranking strategies of keyword search, this framework returns top-N results for an initial query given by the user. As soon as he or she selects some of the top-N res...
متن کاملSupporting top-k join queries in relational databases
where A, B, and C are three relations and A.1,B.1,B.2, and C.2 are attributes of these relations. The Stop After operator limits the output to the first five tuples. In Query, the only way to produce ranked results on the expression 0.3*A.1+0.7*B.2 is by using a sort operator on top of the join.Despite the fact that individual orders exist on A.1 and B.2, current join operators cannot make use ...
متن کاملProcessing Top N and Bottom N Queries
In certain application areas, such as those related to decision support or multimedia data, users wish to ask so-called top N and bottom N queries; these are queries that request a certain number of answers (N) having the highest or lowest values for some attribute, expression, or function. For example, rather than nding all publications on a certain topic, a researcher may want to retrieve the...
متن کاملProcessing of Top-k Selection Queries in Relational Database System
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typically a rank of the top-k tuples that best match the given attribute values. Focusing on the top-k items according to a ranking criterion constitutes an important functionality in many different query answering scenarios....
متن کاملA Framework for Processing Keyword-based Queries in Relational Databases
The large sizes of existing databases are rapidly increasing with time. In this environment, there is a need to help users, who are usually not familiar with SQL statements and the schema of a database, in getting the information sorted according to their relevancy. In response to this need, many researchers have introduced the capability of querying a database based on a list of keywords. A us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2015
ISSN: 1796-217X
DOI: 10.17706/jsw.10.2.162-171